Modeling Concurrent systems speci ed in a Temporal Concurrent Constraint

نویسنده

  • A. Policriti
چکیده

In this paper we present an approach to model concurrent systems speciied in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs speciied in such language. This work is the rst step to the framework construction. We present a formalism to transform a speciication into a tcc Structure. This structure is a graph representation of the program behavior. Our basic tool is the Timed Concurrent Constraint Programming (tcc) framework deened by Saraswat et al. to describe reactive systems. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of time is built into the semantics of the programming language. In fact, on this ground it becomes reasonable to introduce the idea of applying the technique of Model Checking to a nite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be nite and hence Model Checking algorithms to be applicable. The graph construction is a completely automatic process that takes as input the tcc speciication.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling and Testing OO Distributed Systems with Temporal Logic Formalisms

Our ability to test a distributed system is directly related to the quality of the system's speci cation. The speci cation must be complete. That is, the system should have a speci ed behavior for every point in the input space. The speci cations of all of the components in the system must be consistent with each other. Ultimately the speci cation must accurately (i.e., correctly) model the rea...

متن کامل

Veri cation and Debugging of Concurrent Constraint Programs through Abstract Interpretation with Set Constraints

The existing automated veri cation methods apply mainly to those concurrent systems where the number of concurrent processes is statically xed and the data dependencies of the control ow are simple Systems that are speci ed and programmed in the concurrent constraint programming paradigm cc speci cally overcome those two limitations There memory states are modeled by logical formulae constraint...

متن کامل

Executing Formal Specifications with Constraint Programming

We have implemented a technique for execution of formal, model-based speci cations. The speci cations we can execute are written at a level of abstraction that has not previously been supported in executable speci cation languages. The speci cation abstractions supported by our execution technique include quanti ed assertions that reference post-state values, and indirect de nitions of post-sta...

متن کامل

Temporal Concurrent Constraint Programming: Denotation, Logic and Applications

The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior. We call this tcc extension the ntcc calculus. We also give a denotational semantics for the strongestpostcondition of ntcc processes and, based on this semantic...

متن کامل

Using tccp for the Speci cation of Communication Protocols ∗

The automatic analysis of cryptographic protocols by using formal methods on concurrent languages is a subject widely treated in the literature. From its beginning in the decade of the 70s, the eld has been gaining maturity and consolidation. The Timed Concurrent Constraint Language (tccp in short) is a declarative concurrent programming language which, like other concurrent languages, allows u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000